Base | Representation |
---|---|
bin | 111110110100111… |
… | …000101110011110 |
3 | 2201110101100110110 |
4 | 332310320232132 |
5 | 4124314114410 |
6 | 252331550450 |
7 | 35056200441 |
oct | 7664705636 |
9 | 2643340413 |
10 | 1054051230 |
11 | 4a0a91321 |
12 | 254bbb426 |
13 | 13a4b356b |
14 | 9ddbb658 |
15 | 6280b720 |
hex | 3ed38b9e |
1054051230 has 16 divisors (see below), whose sum is σ = 2529723024. Its totient is φ = 281080320.
The previous prime is 1054051211. The next prime is 1054051241. The reversal of 1054051230 is 321504501.
It is a super-2 number, since 2×10540512302 = 2222047990929025800, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1054051197 and 1054051206.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17567491 + ... + 17567550.
It is an arithmetic number, because the mean of its divisors is an integer number (158107689).
Almost surely, 21054051230 is an apocalyptic number.
1054051230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1054051230 is an abundant number, since it is smaller than the sum of its proper divisors (1475671794).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1054051230 is a wasteful number, since it uses less digits than its factorization.
1054051230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35135051.
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 1054051230 is about 32466.1551465522. The cubic root of 1054051230 is about 1017.7018714176.
Adding to 1054051230 its reverse (321504501), we get a palindrome (1375555731).
The spelling of 1054051230 in words is "one billion, fifty-four million, fifty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •