Base | Representation |
---|---|
bin | 11110000010101011011… |
… | …01010110100100100101 |
3 | 10122200100220001022111220 |
4 | 33001111231112210211 |
5 | 113403001401301313 |
6 | 2110111105250553 |
7 | 134401424052612 |
oct | 17012555264445 |
9 | 3580326038456 |
10 | 1032230103333 |
11 | 368847a8a630 |
12 | 148077933a59 |
13 | 764536a22c0 |
14 | 37d62b27509 |
15 | 1bcb6056823 |
hex | f055b56925 |
1032230103333 has 32 divisors (see below), whose sum is σ = 1632929058432. Its totient is φ = 571753824000.
The previous prime is 1032230103323. The next prime is 1032230103389. The reversal of 1032230103333 is 3333010322301.
1032230103333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1032230103333 - 232 = 1027935136037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1032230103323) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11868210 + ... + 11954867.
It is an arithmetic number, because the mean of its divisors is an integer number (51029033076).
Almost surely, 21032230103333 is an apocalyptic number.
1032230103333 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1032230103333 is a deficient number, since it is larger than the sum of its proper divisors (600698955099).
1032230103333 is a wasteful number, since it uses less digits than its factorization.
1032230103333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23823205.
The product of its (nonzero) digits is 2916, while the sum is 24.
Adding to 1032230103333 its reverse (3333010322301), we get a palindrome (4365240425634).
The spelling of 1032230103333 in words is "one trillion, thirty-two billion, two hundred thirty million, one hundred three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •