Base | Representation |
---|---|
bin | 111010010101001… |
… | …0101000101001000 |
3 | 12001101220202222110 |
4 | 1310222111011020 |
5 | 13002024102243 |
6 | 522114422320 |
7 | 66334244163 |
oct | 16452250510 |
9 | 5041822873 |
10 | 1957253448 |
11 | 914900537 |
12 | 4675919a0 |
13 | 25265b647 |
14 | 147d2cada |
15 | b6c6be33 |
hex | 74a95148 |
1957253448 has 96 divisors (see below), whose sum is σ = 5281194240. Its totient is φ = 603799680.
The previous prime is 1957253407. The next prime is 1957253453. The reversal of 1957253448 is 8443527591.
It is a junction number, because it is equal to n+sod(n) for n = 1957253397 and 1957253406.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 391090 + ... + 396062.
It is an arithmetic number, because the mean of its divisors is an integer number (55012440).
Almost surely, 21957253448 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1957253448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2640597120).
1957253448 is an abundant number, since it is smaller than the sum of its proper divisors (3323940792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1957253448 is a wasteful number, since it uses less digits than its factorization.
1957253448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5059 (or 5032 counting only the distinct ones).
The product of its digits is 1209600, while the sum is 48.
The square root of 1957253448 is about 44240.8572249680. The cubic root of 1957253448 is about 1250.8801157449.
The spelling of 1957253448 in words is "one billion, nine hundred fifty-seven million, two hundred fifty-three thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •