Base | Representation |
---|---|
bin | 1100000001000110010000… |
… | …1011110110100001111000 |
3 | 1201210011001201000101011010 |
4 | 3000101210023312201320 |
5 | 3212440211024343112 |
6 | 44033545110433520 |
7 | 2532415314604530 |
oct | 300214413664170 |
9 | 51704051011133 |
10 | 13213000231032 |
11 | 4234669193988 |
12 | 15949270628a0 |
13 | 74ac9942a494 |
14 | 3397268d24c0 |
15 | 17da790a663c |
hex | c04642f6878 |
13213000231032 has 64 divisors (see below), whose sum is σ = 37756254988800. Its totient is φ = 3774660347520.
The previous prime is 13213000230967. The next prime is 13213000231037. The reversal of 13213000231032 is 23013200031231.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13213000231037) 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, 3707644 + ... + 6338187.
It is an arithmetic number, because the mean of its divisors is an integer number (589941484200).
Almost surely, 213213000231032 is an apocalyptic number.
13213000231032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13213000231032 is an abundant number, since it is smaller than the sum of its proper divisors (24543254757768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13213000231032 is a wasteful number, since it uses less digits than its factorization.
13213000231032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10053676 (or 10053672 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 13213000231032 its reverse (23013200031231), we get a palindrome (36226200262263).
The spelling of 13213000231032 in words is "thirteen trillion, two hundred thirteen billion, two hundred thirty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •