Base | Representation |
---|---|
bin | 10100110110110010110… |
… | …100000111000010010000 |
3 | 12002000101212000200020110 |
4 | 110312302310013002100 |
5 | 141440220333124240 |
6 | 3014225234441320 |
7 | 205355425652055 |
oct | 24666264070220 |
9 | 5060355020213 |
10 | 1433224114320 |
11 | 502910715109 |
12 | 1b1927a33240 |
13 | a51c9c3180b |
14 | 4d522d1902c |
15 | 27434d4bc80 |
hex | 14db2d07090 |
1433224114320 has 160 divisors (see below), whose sum is σ = 4454149201920. Its totient is φ = 381234872320.
The previous prime is 1433224114303. The next prime is 1433224114373. The reversal of 1433224114320 is 234114223341.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 169668337 + ... + 169676783.
It is an arithmetic number, because the mean of its divisors is an integer number (27838432512).
Almost surely, 21433224114320 is an apocalyptic number.
1433224114320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1433224114320 is an abundant number, since it is smaller than the sum of its proper divisors (3020925087600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1433224114320 is a wasteful number, since it uses less digits than its factorization.
1433224114320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10153 (or 10147 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 1433224114320 its reverse (234114223341), we get a palindrome (1667338337661).
The spelling of 1433224114320 in words is "one trillion, four hundred thirty-three billion, two hundred twenty-four million, one hundred fourteen thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •