Base | Representation |
---|---|
bin | 11000101001001010… |
… | …01101101001011000 |
3 | 1021011000221212110110 |
4 | 30110211031221120 |
5 | 204043412421212 |
6 | 10024453044320 |
7 | 645566566560 |
oct | 142445155130 |
9 | 37130855413 |
10 | 13230201432 |
11 | 567a116178 |
12 | 26929266a0 |
13 | 132aca1876 |
14 | 8d716dda0 |
15 | 526774a3c |
hex | 31494da58 |
13230201432 has 64 divisors (see below), whose sum is σ = 37835193600. Its totient is φ = 3776595840.
The previous prime is 13230201401. The next prime is 13230201433. The reversal of 13230201432 is 23410203231.
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 = 13230201399 and 13230201408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13230201433) 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, 150807 + ... + 221817.
It is an arithmetic number, because the mean of its divisors is an integer number (591174900).
Almost surely, 213230201432 is an apocalyptic number.
13230201432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13230201432 is an abundant number, since it is smaller than the sum of its proper divisors (24604992168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13230201432 is a wasteful number, since it uses less digits than its factorization.
13230201432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72136 (or 72132 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 13230201432 its reverse (23410203231), we get a palindrome (36640404663).
The spelling of 13230201432 in words is "thirteen billion, two hundred thirty million, two hundred one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •