Base | Representation |
---|---|
bin | 10110111111001111101101… |
… | …100001110000111101011110 |
3 | 111020222101002020211000220102 |
4 | 112333033231201300331132 |
5 | 101222433343334411110 |
6 | 555010102253021102 |
7 | 30203316022323332 |
oct | 2677175541607536 |
9 | 436871066730812 |
10 | 101103220232030 |
11 | 2a23a6a907a155 |
12 | b40a593a84792 |
13 | 4454cba124953 |
14 | 1ad75c9c4d7c2 |
15 | ba4dd7d185a5 |
hex | 5bf3ed870f5e |
101103220232030 has 32 divisors (see below), whose sum is σ = 182327031406080. Its totient is φ = 40365465023520.
The previous prime is 101103220232029. The next prime is 101103220232057. The reversal of 101103220232030 is 30232022301101.
It is a super-3 number, since 3×1011032202320303 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 101103220231993 and 101103220232011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 119431391 + ... + 120274949.
It is an arithmetic number, because the mean of its divisors is an integer number (5697719731440).
Almost surely, 2101103220232030 is an apocalyptic number.
101103220232030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101103220232030 is a deficient number, since it is larger than the sum of its proper divisors (81223811174050).
101103220232030 is a wasteful number, since it uses less digits than its factorization.
101103220232030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 866024.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 101103220232030 its reverse (30232022301101), we get a palindrome (131335242533131).
The spelling of 101103220232030 in words is "one hundred one trillion, one hundred three billion, two hundred twenty million, two hundred thirty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •