Base | Representation |
---|---|
bin | 1011110110101000000101… |
… | …0110110111101001100000 |
3 | 1201010221201012221011212211 |
4 | 2331222001112313221200 |
5 | 3202013242331011112 |
6 | 43415153550331504 |
7 | 2513416251624064 |
oct | 275520126675140 |
9 | 51127635834784 |
10 | 13033101032032 |
11 | 4175341840014 |
12 | 1565a9b1b9b94 |
13 | 73702964a1c3 |
14 | 330b3c255aa4 |
15 | 17904a6600a7 |
hex | bda815b7a60 |
13033101032032 has 12 divisors (see below), whose sum is σ = 25658917656876. Its totient is φ = 6516550516000.
The previous prime is 13033101031939. The next prime is 13033101032123. The reversal of 13033101032032 is 23023010133031.
13033101032032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×130331010320322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13033101031994 and 13033101032012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 203642203594 + ... + 203642203657.
It is an arithmetic number, because the mean of its divisors is an integer number (2138243138073).
Almost surely, 213033101032032 is an apocalyptic number.
It is an amenable number.
13033101032032 is a deficient number, since it is larger than the sum of its proper divisors (12625816624844).
13033101032032 is an equidigital number, since it uses as much as digits as its factorization.
13033101032032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 407284407261 (or 407284407253 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 13033101032032 its reverse (23023010133031), we get a palindrome (36056111165063).
The spelling of 13033101032032 in words is "thirteen trillion, thirty-three billion, one hundred one million, thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •