Base | Representation |
---|---|
bin | 10010111100110010111… |
… | …101010011010001110000 |
3 | 11121111021122112021021010 |
4 | 102330302331103101300 |
5 | 132313431341134412 |
6 | 2434123004430520 |
7 | 163040321355120 |
oct | 22746275232160 |
9 | 4544248467233 |
10 | 1302230021232 |
11 | 4622aa997148 |
12 | 19046a248440 |
13 | 95a5210a62a |
14 | 470577dcc80 |
15 | 23d19ac233c |
hex | 12f32f53470 |
1302230021232 has 40 divisors (see below), whose sum is σ = 3844679111296. Its totient is φ = 372065720256.
The previous prime is 1302230021231. The next prime is 1302230021237. The reversal of 1302230021232 is 2321200322031.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1302230021199 and 1302230021208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1302230021231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1937841958 + ... + 1937842629.
Almost surely, 21302230021232 is an apocalyptic number.
1302230021232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1302230021232 is an abundant number, since it is smaller than the sum of its proper divisors (2542449090064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1302230021232 is a wasteful number, since it uses less digits than its factorization.
1302230021232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3875684605 (or 3875684599 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 1302230021232 its reverse (2321200322031), we get a palindrome (3623430343263).
The spelling of 1302230021232 in words is "one trillion, three hundred two billion, two hundred thirty million, twenty-one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •