Base | Representation |
---|---|
bin | 11101011011001011010… |
… | …11011110011010010010 |
3 | 10120122121221112112000220 |
4 | 32231211223132122102 |
5 | 113031033420211010 |
6 | 2052242504053510 |
7 | 133021045330623 |
oct | 16554553363222 |
9 | 3518557475026 |
10 | 1011023210130 |
11 | 35a85527690a |
12 | 143b39764296 |
13 | 74453c5b79b |
14 | 36d10439a4a |
15 | 1b47438c970 |
hex | eb65ade692 |
1011023210130 has 32 divisors (see below), whose sum is σ = 2426643878400. Its totient is φ = 269585281152.
The previous prime is 1011023210083. The next prime is 1011023210143. The reversal of 1011023210130 is 310123201101.
It is a happy number.
It is a super-3 number, since 3×10110232101303 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 911515 + ... + 1689054.
It is an arithmetic number, because the mean of its divisors is an integer number (75832621200).
Almost surely, 21011023210130 is an apocalyptic number.
1011023210130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1011023210130 is an abundant number, since it is smaller than the sum of its proper divisors (1415620668270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011023210130 is a wasteful number, since it uses less digits than its factorization.
1011023210130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2613538.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1011023210130 its reverse (310123201101), we get a palindrome (1321146411231).
The spelling of 1011023210130 in words is "one trillion, eleven billion, twenty-three million, two hundred ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •