Base | Representation |
---|---|
bin | 10100110110100110110… |
… | …010010111100101101000 |
3 | 12001222212210100000220001 |
4 | 110312212302113211220 |
5 | 141434312204044430 |
6 | 3014153225512344 |
7 | 205350425560153 |
oct | 24664662274550 |
9 | 5058783300801 |
10 | 1433022331240 |
11 | 502817824535 |
12 | 1b18903426b4 |
13 | a51971a1a46 |
14 | 4d5041d0c9a |
15 | 2742228e3ca |
hex | 14da6c97968 |
1433022331240 has 64 divisors (see below), whose sum is σ = 3402956088000. Its totient is φ = 541607109120.
The previous prime is 1433022331217. The next prime is 1433022331243. The reversal of 1433022331240 is 421332203341.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1433022331199 and 1433022331208.
It is not an unprimeable number, because it can be changed into a prime (1433022331243) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2199501 + ... + 2775580.
It is an arithmetic number, because the mean of its divisors is an integer number (53171188875).
Almost surely, 21433022331240 is an apocalyptic number.
1433022331240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1433022331240 is an abundant number, since it is smaller than the sum of its proper divisors (1969933756760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1433022331240 is a wasteful number, since it uses less digits than its factorization.
1433022331240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4975490 (or 4975486 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 1433022331240 its reverse (421332203341), we get a palindrome (1854354534581).
The spelling of 1433022331240 in words is "one trillion, four hundred thirty-three billion, twenty-two million, three hundred thirty-one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •